Computation Rules and Logarithms
نویسندگان
چکیده
منابع مشابه
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We discover several things that were previously overlooked in the implementation of Coppersmith’s algor...
متن کاملComputation of Discrete Logarithms in F2607
We describe in this article how we have been able to extend the record for computations of discrete logarithms in characteristic 2 from the previous record over F2503 to a newer mark of F2607 , using Coppersmith’s algorithm. This has been made possible by several practical improvements to the algorithm. Although the computations have been carried out on fairly standard hardware, our opinion is ...
متن کامل- 1 - Computation of Discrete Logarithms in PrimeFieldsB
The presumed diiculty of computing discrete logarithms in nite elds is the basis of several popular public key cryptosystems. The secure identiication option of the Sun Network File System, for example, uses discrete logarithms in a eld GF(p) with p a prime of 192 bits. This paper describes an implementation of a discrete logarithm algorithm which shows that primes of under 200 bits, such as th...
متن کاملQuantum computation of discrete logarithms in semigroups
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor’s algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete logarithms in semigroups are insecure against quantum attacks. In contrast, we show that some generalizations of the discrete log problem are hard in semigroup...
متن کاملAutomatic Computation of Exponentials , Logarithms , Ratios and Square Roots *
I t is shown how a relatively simple device can evaluate exponentials, logarithms, ratios and square roots for fraction arguments, employing only shifts, adds, high-speed table lookups, and bit counting. The scheme is based on the cotransformation of a number pair ( x , y ) such that the F ( x , y ) = f ( x o ) is invariant; when x is driven towards a known value xu, y is driven towards the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1896
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.3.66.526